Preconditioned iterative methods on sparse subspaces
نویسندگان
چکیده
منابع مشابه
Partitioning Sparse Matrices for Parallel Preconditioned Iterative Methods
This paper addresses the parallelization of the preconditioned iterative methods that use explicit preconditioners such as approximate inverses. Parallelizing a full step of these methods requires the coefficient and preconditioner matrices to be well partitioned. We first show that different methods impose different partitioning requirements for the matrices. Then we develop hypergraph models ...
متن کاملSparse Preconditioned Iterative Methods for Dense Linear Systems
Two sparse preconditioned iterative methods are presented to solve dense linear systems arising in the solution of two dimensional boundary integral equations. In the rst method, the sparse preconditioner is constructedsimply by choosing a small block of elements in the coeecient matrix of a dense linear system. The two-grid method falls into this category when the dense linear system arises fr...
متن کاملOn Preconditioned Iterative Methods for Burgers Equations
We study the Newton method and a fixed-point method for solving the system of nonlinear equations arising from the Sinc-Galerkin discretization of the Burgers equations. In each step of the Newton method or the fixedpoint method, a structured subsystem of linear equations is obtained and needs to be solved numerically. In this paper, preconditioning techniques are applied to solve such linear s...
متن کاملIterative Methods Based on Krylov Subspaces
with a symmetric and positive definite operator A defined on a Hilbert space V with dimV = N and its preconditioned version PCG. We derive the CG from the projection in A-inner product point of view. We shall use (·, ·) for the standard inner product and (·, ·)A for the inner product introduced by the SPD operator A. When we say ‘orthogonal’ vectors, we refer to the default (·, ·) inner product...
متن کاملParallel Solution of Sparse Triangular Linear Systems in the Preconditioned Iterative Methods on the GPU
A novel algorithm for solving in parallel a sparse triangular linear system on a graphical processing unit is proposed. It implements the solution of the triangular system in two phases. First, the analysis phase builds a dependency graph based on the matrix sparsity pattern and groups the independent rows into levels. Second, the solve phase obtains the full solution by iterating sequentially ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2006
ISSN: 0893-9659
DOI: 10.1016/j.aml.2005.11.027